import java.util.Deque;
import java.util.LinkedList;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 刘国水
 * Date: 2025-05-16
 * Time: 21:51
 */
public class test {
    public static void quickSortNor(int[] array) {
        int start = 0;
        int end = array.length-1;
        int par = parttion2(array,start,end);

        Deque<Integer> stack = new LinkedList<>();
        //左边有2个数对
        if(par > start+1) {
            stack.push(start);
            stack.push(par-1);
        }
        //右边有2个数对

        //栈是否为空  直到栈为空 则结束   每次从栈里 拿出2个元素

    }
//    private static int parttion(int[] array, int low, int high) {
//        int tmp = array[low];
//        while (low < high) {
//            low++;
//            if(array[low] > tmp && array[high] < tmp) {
//                array[low] = array[high];
//                array[high] = array[low];
//            }
//            high--;
//        }
//        return low;
//    }
//
//    public static void main(String[] args) {
//        int[] array = {6,3,5,7,4,9,1,8};
//
//    }
}
